Connected Even Factors in the Square of Essentially 2-Edge-connected Graph
نویسندگان
چکیده
منابع مشابه
Connected Even Factors in the Square of Essentially 2-Edge-connected Graph
An essentially k-edge connected graph G is a connected graph such that deleting less than k edges from G cannot result in two nontrivial components. In this paper we prove that if an essentially 2-edge-connected graph G satisfies that for any pair of leaves at distance 4 in G there exists another leaf of G that has distance 2 to one of them, then the square G2 has a connected even factor with m...
متن کاملStar subdivisions and connected even factors in the square of a graph
For any positive integer s, a [2, 2s]-factor in a graph G is a connected even factor with maximum degree at most 2s. We prove that if every induced S(K1,2s+1) in a graph G has at least 3 edges in a block of degree at most two, then G has a [2, 2s]-factor. This extends the results of Hendry and Vogler and of Abderrezzak et al.
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملEvery 3-connected, essentially 11-connected line graph is Hamiltonian
Thomassen conjectured that every 4-connected line graph is Hamiltonian. A vertex cut X of G is essential if G−X has at least two non-trivial components. We prove that every 3-connected, essentially 11-connected line graph is Hamiltonian. Using Ryjác̆ek’s line graph closure, it follows that every 3-connected, essentially 11-connected claw-free graph is Hamiltonian. © 2005 Elsevier Inc. All rights...
متن کاملGenerating connected and 2-edge connected graphs
We focus on the algorithm underlying the main result of [6]. This is an algebraic formula to generate all connected graphs in a recursive and efficient manner. The key feature is that each graph carries a scalar factor given by the inverse of the order of its group of automorphisms. In the present paper, we revise that algorithm on the level of graphs. Moreover, we extend the result subsequentl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/5467